skip to main content


Search for: All records

Creators/Authors contains: "Cho, S."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Free, publicly-accessible full text available July 26, 2024
  2. null (Ed.)
    Clusters of nitrogen- and carbon-coordinated transition metals dispersed in a carbon matrix (e. g., Fe−N−C) have emerged as an inexpensive class of electrocatalysts for the oxygen reduction reaction (ORR). Here, it was shown that optimizing the interaction between the nitrogen-coordinated transition metal clusters embedded in a more stable and corrosion-resistant carbide matrix yielded an ORR electrocatalyst with enhanced activity and stability compared to Fe−N−C catalysts. Utilizing first-principles calculations, an electrostatics-based descriptor of catalytic activity was identified, and nitrogen-coordinated iron (FeN4) clusters embedded in a TiC matrix were predicted to be an efficient platinum-group metal (PGM)-free ORR electrocatalyst. Guided by theory, selected catalyst formulations were synthesized, and it was demonstrated that the experimentally observed trends in activity fell exactly in line with the descriptor-derived theoretical predictions. The Fe−N−TiC catalyst exhibited enhanced activity (20 %) and durability (3.5-fold improvement) compared to a traditional Fe−N−C catalyst. It was posited that the electrostatics-based descriptor provides a powerful platform for the design of active and stable PGM-free electrocatalysts and heterogenous single-atom catalysts for other electrochemical reactions. 
    more » « less
  3. We present Grapple, a new and powerful framework for explicit-state model checking on GPUs. Grapple is based on swarm verification (SV), a model-checking technique wherein a collection or swarm of small, memory- and time-bounded verification tests (VTs) are run in parallel to perform state-space exploration. SV achieves high state-space coverage via diversification of the search strategies used by constituent VTs. Grapple represents a swarm implementation for the GPU. In particular, it runs a parallel swarm of internally-parallel VTs, which are implemented in a manner that specifically targets the GPU architecture and the SIMD parallelism its computing cores offer. Grapple also makes effective use of the GPU shared memory, eliminating costly inter-block communication overhead. We conducted a comprehensive performance analysis of Grapple focused on the various design parameters, including the size of the queue structure, implementation of guard statements, and nondeterministic exploration order. Tests are run with multiple hardware configurations, including on the Amazon cloud. Our results show that Grapple performs favorably compared to the SPIN swarm and a prior non-swarm GPU implementation. Although a recently debuted FPGA swarm is faster, the deployment process to the FPGA is much more complex than Grapple's. 
    more » « less
  4. Free, publicly-accessible full text available June 1, 2024
  5. A bstract Charged-lepton-flavor-violation is predicted in several new physics scenarios. We update the analysis of τ lepton decays into a light charged lepton ( ℓ = e ± or μ ± ) and a vector meson ( V 0 = ρ 0 , ϕ , ω , K *0 , or $$ \overline{K} $$ K ¯ *0 ) using 980 fb − 1 of data collected with the Belle detector at the KEKB collider. No significant excess of such signal events is observed, and thus 90% credibility level upper limits are set on the τ → ℓV 0 branching fractions in the range of (1.7–4 . 3) × 10 − 8 . These limits are improved by 30% on average from the previous results. 
    more » « less
    Free, publicly-accessible full text available June 1, 2024
  6. Free, publicly-accessible full text available June 1, 2024
  7. Free, publicly-accessible full text available May 1, 2024
  8. Free, publicly-accessible full text available May 1, 2024